A Stability Concept For Zero-One Knapsack Problems And Approximation Algorithms
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Constrained Knapsack Problems
We study constrained versions of the knapsack problem in which dependencies between items are given by a graph. In one version, an item can be selected only if one of its neighbours is also selected. In the other version, an item can be selected only when all its neighbours are also selected. These problems generalize and unify several problems including the prize collecting and budgeted maximu...
متن کاملApproximation Algorithms for Knapsack Problems with Cardinality Constraintsy
We address a variant of the classical knapsack problem in which an upper bound is imposed on the number of items that can be selected. This problem arises in the solution of real-life cutting stock problems by column generation, and may be used to separate cover inequalities with small support within cutting plane approaches to integer linear programs. We focus our attention on approximation al...
متن کاملKnapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization
We study a class of non-convex optimization problems involving sigmoid functions. We show that sigmoid functions impart a combinatorial element to the optimization variables and make the global optimization computationally hard. We formulate versions of the knapsack problem, the generalized assignment problem and the bin-packing problem with sigmoid utilities. We merge approximation algorithms ...
متن کاملThe Zero/one Multiple Knapsack Problem and Genetic Algorithms Genetic Algorithms
A genetic algorithm, GENEsYs, is applied to an NP-complete problem, the 0/1 multiple knapsack problem. The partitioning of the search space resulting from this highly constrained problem may include substantially large infeasible regions. Our implementation allows for the breeding and participation of infeasible strings in the population. Unlike many other GA-based algorithms that are augmented...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFOR: Information Systems and Operational Research
سال: 1995
ISSN: 0315-5986,1916-0615
DOI: 10.1080/03155986.1995.11732274